Necessary Conditions for the Completion of Partial Latin Squares·

نویسنده

  • Tatsuo Oyama
چکیده

A latin square is an n x n square matrix each of which cells contains a symbol chosen from the set 11,2, ... ,n]; each symbol occurs exactly oncl~ in each row or column of the matrix. A partial latin square is a latin square in which some cells are unoccupied. We consider the problem of obtaining necessary and sufficient conditions for a partial latin square to be completed to a latin square. For this problem A. B. Cruse has recently given a necessary condition associated with triply stochastic matrices. In this paper two sets of necessary condtions are given, one developed from network flow theory and another obtained from matroid theory. It is shown that the network condition is equivalent to Cruse's condition and that the matroid condition is strictly stronger than either of the former.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the completion of partial latin squares

The problem of completing partial latin squares to latin squares of the same order has been studied for many years. For instance, in 1960 Evans [9] conjectured that every partial latin square of order n containing at most n− 1 filled cells is completable to a latin square of order n. This conjecture was shown to be true by Lindner [12] and Smetaniuk [13]. Recently, Bryant and Rodger [6] establi...

متن کامل

Completing partial latin squares: Cropper's question

Hall’s condition is a well-known necessary condition for the existence of a proper coloring of a graph from prescribed lists. Completing a partial latin square is a very special kind of graph list-coloring problem. Cropper’s question was: is Hall’s condition sufficient for the existence of a completion of a partial latin square? The folk belief that the answer must be no is confirmed here, but,...

متن کامل

On the Completion of Partial Latin Squares

In this paper a certain condition on partial latin squares is shown to be sufficient to guarantee that the partial square can be completed, namely, that it have fewer than n entries, and that at most [(n + I)/21 of these lie off some line,where n is the order of the square. This is applied to establish that the Evans conjecture is true for n < 8; i.e., that given a partial latin square of order...

متن کامل

The completion of partial Latin squares

In recent times there has been some interest in studying partial latin squares which have no completions or precisely one completion, and which are critical with respect to this property. Such squares are called, respectively, premature partial latin squares and critical sets. There has also been interest in related maximal partial latin squares. This paper will explore the connection between t...

متن کامل

Completion of Partial Latin Squares

In this thesis, the problem of completing partial latin squares is examined. In particular, the completion problem for three primary classes of partial latin squares is investigated. First, the theorem of Marshall Hall regarding completions of latin rectangles is discussed. Secondly, a proof of Evans’ conjecture is presented, which deals with partial latin squares of order n containing at most ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009